Useful metrics for modular robot motion planning
نویسندگان
چکیده
In this paper the problem of dynamic selfreconfiguration of a class of modular robotic systems referred to as metamorphic systems is examined. A metamorphic robotic system is a collection of mechatronic modules, each of which has the ability to connect, disconnect, and climb over adjacent modules. We examine the near-optimal reconfiguration of a metamorphic robot from an arbitrary initial configuration to a desired final configuration. Concepts of distance between metamorphic robot configurations are defined, and shown to satisfy the formal properties of a metric. These metrics, called configuration metrics, are then applied to the automatic self-reconfiguration of metamorphic systems in the case when one module is allowed to move at a time. There is no simple method for computing the optimal sequence of moves required to reconfigure. As a result, heuristics which can give a near optimal solution must be used. We use the technique of Simulated Annealing to drive the reconfiguration process with configuration metrics as cost functions. The relative performance of simulated annealing with different cost functions is compared and the usefulness of the metrics developed in this paper is demonstrated.
منابع مشابه
Motion Planning for Heterogeneous Modular Mobile Systems
This paper addresses the issue of developing a motion planning algorithm for a general class of modular mobile robots. A modular mobile robot is essentially a reconfigurable robot system in which locomotive modules such as legs, wheels, propellers, etc. can be attached at various locations on the body. The equations of motion for the robot are developed in terms of a set of generalized inputs r...
متن کاملPlanning Robot Motion in a 2-D Region with Unknown Obstacles
The purpose of this paper is to present several algorithms for planning the motion of a robot in a two-dimensional region having obstacles whose shapes and locations are unknown. The convergence and efficiency of the algorithms are discussed and upper bounds for the lengths of paths generated by the different algorithms are derived and compared.
متن کاملAutonomously Traversing Obstacles - Metrics for Path Planning of Reconfigurable Robots on Rough Terrain
The fixed chassis design of commonly employed mobile robots restricts their application to fairly flat environments, as the wheel diameters or the track heights impose hard limits on their mobility. Unstructured outdoor and urban environments alike comprehend many different invincible obstacles for most of those systems, like stairs, boulders or rubble. However, there are mobile robots with rec...
متن کاملMotion Planning for a Self-Reconfigurable Modular Robot
This paper addresses motion planning of a homogeneous modular robotic system. The modules have self-reconfiguration capability so that a group of the modules can construct a robotic structure generating dynamic motion. Motion planning for self-reconfiguration is not straightforward because the modular structure allows many combinatorial configurations, and also the proposed module has only two ...
متن کاملA motion planning method for a self-reconfigurable modular robot
This paper addresses motion planning of a homogeneous modular robotic system. The modules have selfreconfiguration capability so that a group of the modules can construct a robotic structure. Motion planning for selfreconfiguration is a kind of computationally difficult problem because of many combinatorial possibilities of modular configuration and the restricted degrees of freedom of the modu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Robotics and Automation
دوره 13 شماره
صفحات -
تاریخ انتشار 1997